Minimal rank completions for overlapping blocks
نویسندگان
چکیده
We consider the multi-objective optimization problem of choosing bottom left block-entry a block lower triangular matrix to minimize ranks all sub-matrices. provide proof that there exists simultaneous rank-minimizer by constructing complete set minimizers.
منابع مشابه
A Matrix and Its Inverse: Revisiting Minimal Rank Completions
We revisit a formula that connects the minimal ranks of triangular parts of a matrix and its inverse and relate the result to structured rank matrices. We also address the generic minimal rank problem.
متن کاملMinimal Interval Completions
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means that no proper subset of the added edges can result in an interval graph when added to the original graph. This problem is closely related to the problem of adding an inclusion minimal set of edges to a graph to obtai...
متن کاملMinimal comparability completions
We study the problem of adding edges to a given arbitrary graph so that the resulting graph is a comparability graph, called a comparability completion of the input graph. Computing a comparability completion with the minimum possible number of added edges is an NP-hard problem. Our purpose here is to add an inclusion minimal set of edges to obtain a minimal comparability completion, which mean...
متن کاملMinimal split completions
We study the problem of adding an inclusion minimal set of edges to a given arbitrary graph so that the resulting graph is a split graph, called a minimal split completion of the input graph. Minimal completions of arbitrary graphs into chordal and interval graphs have been studied previously, and new results have been added recently. We extend these previous results to split graphs by giving a...
متن کاملMinimal Proper Interval Completions
Given an arbitrary graph G = (V,E) and a proper interval graph H = (V, F ) with E ⊆ F we say that H is a proper interval completion of G. The graph H is called a minimal proper interval completion of G if, for any sandwich graph H ′ = (V, F ′) with E ⊆ F ′ ⊂ F , H ′ is not a proper interval graph. In this paper we give a O(n+m) time algorithm computing a minimal proper interval completion of an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2021
ISSN: ['1873-1856', '0024-3795']
DOI: https://doi.org/10.1016/j.laa.2021.06.011